MILP formulations for highway petrol station replenishment in initiative distribution mode

نویسندگان

چکیده

Abstract To investigate highway petrol station replenishment in initiative distribution mode, this paper develops a mixed-integer linear programming (MILP) model with minimal operational costs that includes loading costs, unloading transport and the caused by unpunctual distribution. Based on discrete representation, working day is divided into equal time intervals, truck process decomposed pair of tasks including driving, standby, rest, unloading. Each must execute one task during single interval, currently executing closely related to preceding subsequent tasks. By accounting for predictive time-varying sales at stations, real-time road congestion series constraints, proposed produces optimal dispatch, namely, detailed assignment all trucks each interval. The tested real-world case system comprising eight depot, garage demonstrate its applicability accuracy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solution Methods for the Periodic Petrol Station Replenishment Problem

Abstract: In this paper we introduce the Periodic Petrol Station Replenishment Problem (PPSRP) over a T-day planning horizon and describe four heuristic methods for its solution. Even though all the proposed heuristics belong to the common partitioning-then-routing paradigm, they differ in assigning the stations to each day of the horizon. The resulting daily routing problems are then solved ex...

متن کامل

An exact algorithm for the petrol station replenishment problem

In the Petrol Station Replenishment Problem (PSRP) the aim is to jointly determine an allocation of petroleum products to tank truck compartments and to design delivery routes to stations. This article describes an exact algorithm for the PSRP. This algorithm was extensively tested on randomly generated data and on a real-life case arising in Eastern Quebec.

متن کامل

A heuristic for the multi-period petrol station replenishment problem

In the Multi-Period Petrol Station Replenishment Problem (MPSRP) the aim is to optimize the delivery of several petroleum products to a set of petrol stations over a given planning horizon. One must determine, for each day of the planning horizon, how much of each product should be delivered to each station, how to load these products into vehicle compartments, and how to plan vehicle routes. T...

متن کامل

The petrol station replenishment problem with time windows

In the Petrol Station Replenishment Problem with Time Windows (PSRPTW) the aim is to optimize the delivery of several petroleum products to a set of petrol stations using a limited heterogeneous fleet of tank-trucks. More specifically, one must determine the quantity of each product to deliver, the assignment of products to truck compartments, delivery routes, and schedules. The objective is to...

متن کامل

Trip Packing in Petrol Stations Replenishment

This paper considers a generalized version of the trip packing problem that we encountered as a sub-problem of the petrol stations replenishment problem. In this version we have to assign a number of trips to a fleet composed of a limited number of non-identical tank-trucks. Each trip has a specific duration, working time of vehicles is limited and the net revenue of each trip depends on the tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Petroleum Science

سال: 2021

ISSN: ['1672-5107', '1995-8226']

DOI: https://doi.org/10.1007/s12182-021-00551-4